Probabilistic Algorithms, Integration, and Empirical Evaluation for Disambiguating Multiple Selections in Frustum-Based Pointing

نویسندگان

  • Greg S. Schmidt
  • Dennis G. Brown
  • Erik B. Tomlin
  • J. Edward Swan
  • Yohan Baillot
چکیده

There are a few fundamental pointing-based user interface techniques for performing selections in 3D environments. One of these techniques is ray pointing, which makes selections by determining intersections of objects along a single ray cast from the user. This technique is susceptible to inaccuracy of the user interface tracking technology and user noise (e.g., jittery hand, see actual viewing ray in Figure 1 (bottom) and how it misses the object when error is factored in). Another technique is the frustum-based (or equivalent cone-based) approach which casts a frustum from the user into the 3D scene. Selections are made by performing intersections of objects with the frustum. This technique resolves the imprecision associated with the ray pointing technique (see how the lightly shaded cone in Figure 1 (bottom) still intersects the object), but may produce multiple ambiguous selections as shown in Figure 2. This paper presents probabilistic selection algorithms and integration schemes that address some of the ambiguities associated with the frustum-based selection technique. The selection algorithms assign probabilities that the user has selected particular objects using a set of low-level 3D intersection-based selection techniques and the relationship of the objects in a hierarchical database. Final selections are generated by integating the outputs from each selection algorithm using one of several weighting schemes. We implemented the selection algoithms and weighting schemes within our distributed augmented reality (AR) and virtual reality (VR) architecture. Next, we performed several experiments to empirically evaluate the probabilistic selection techniques and integration schemes. Our results show that the combined selection and integration algorithms are effective at disambiguating multiple selections. This paper thoroughly describes the architecture, experiments, and results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A modification of probabilistic hesitant fuzzy sets and its application to multiple criteria decision making

Probabilistic hesitant fuzzy set (PHFS) is a fruitful concept that adds to hesitant fuzzy set (HFS) the term of probability which is able to retain more information than the usual HFS. Here, we demonstrate that the existing definitions of PHFS are not still reasonable, and therefore, we first improve the PHFS definition. By endowing the set and algebraic operations with a new re-definition of P...

متن کامل

An Application of the ABS LX Algorithm to Multiple Sequence Alignment

We present an application of ABS algorithms for multiple sequence alignment (MSA). The Markov decision process (MDP) based model leads to a linear programming problem (LPP), whose solution is linked to a suggested alignment. The important features of our work include the facility of alignment of multiple sequences simultaneously and no limit for the length of the sequences. Our goal here is to ...

متن کامل

Data envelopment analysis in service quality evaluation: an empirical study

Service quality is often conceptualized as the comparison between service expectations and the actual performance perceptions. It enhances customer satisfaction, decreases customer defection, and promotes customer loyalty. Substantial literature has examined the concept of service quality, its dimensions, and measurement methods. We introduce the perceived service quality index (PSQI) as a sing...

متن کامل

BeeID: intrusion detection in AODV-based MANETs using artificial Bee colony and negative selection algorithms

Mobile ad hoc networks (MANETs) are multi-hop wireless networks of mobile nodes constructed dynamically without the use of any fixed network infrastructure. Due to inherent characteristics of these networks, malicious nodes can easily disrupt the routing process. A traditional approach to detect such malicious network activities is to build a profile of the normal network traffic, and then iden...

متن کامل

Assessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories

In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Multimedia

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2006